Computing a planar widest empty alpha-siphon in o(n3) time
نویسندگان
چکیده
Given a set of n points P in the Euclidean plane, we consider the problem of locating a 1-corner polygonal chain X such that minp∈P d(p, X) is maximized. The polygonal chain has the added property that its interior angle is α and it partitions P . In this note we present an algorithm that solves the problem in o(n) time and space. The previous best running time for this problem was O(n log n) time [2].
منابع مشابه
On finding widest empty curved corridors
An α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle α, we want to compute the widest empty α-siphon that splits P into two non-empty sets. We present an efficient O(n log n)-time algorithm for computing the widest oriented α-si...
متن کاملComputing a planar widest empty α - siphon in o ( n 3 ) time
Given a set of n points P in the Euclidean plane, we consider the problem of locating a 1-corner polygonal chain X such that minp∈P d(p,X) is maximized. The polygonal chain has the added property that its interior angle is α and it partitions P . In this note we present an algorithm that solves the problem in o(n) time and space. The previous best running time for this problem was O(n log n) ti...
متن کاملOn finding a widest empty 1-corner corridor
A 1-corner corridor through a set S of points is an open subset of CH(S) containing no points from S and bounded by a pair of parallel polygonal lines each of which contains two segments. Given a set of n points in the plane, we consider the problem of computing a widest empty 1-corner corridor. We describe an algorithm that solves the problem in O(n4 logn) time and O(n) space. We also present ...
متن کاملComputing the Widest Empty Boomerang
In this paper we consider the following obnoxious facility location problem: given a set S of n points in the plane, and two special points a and b, find the 1-corner polygonal chain (also known as boomerang) connecting a and b such that its minimum distance to S is maximized. In other words: find the widest empty polygonal chain of two edges having extremes anchored at a and b. We present a ne...
متن کاملMinimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time
A minimum cycle basis of a weighted undirected graph G is a basis of the cycle space of G such that the total weight of the cycles in this basis is minimized. If G is a planar graph with non-negative edge weights, such a basis can be found in O(n2) time and space, where n is the size of G. We show that this is optimal if an explicit representation of the basis is required. We then present an O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007